Decidability of Invariant Validation for Paramaterized Systems

نویسندگان

  • Pascal Fontaine
  • E. Pascal Gribomont
چکیده

The control part of many concurrent and distributed programs reduces to a set Π = {p1, . . . , pn} of symmetric processes containing mainly assignments and tests on Boolean variables. However, the assignments, the guards and the program invariants can beΠ-quantified, so the corresponding verification conditions also involve Π-quantifications. We propose a systematic procedure allowing the elimination of such quantifications for a large class of program invariants. At the core of this procedure is a variant of the Herbrand Theorem for many-sorted first-order logic with equality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Decidability of Reachability in Linear Time-Invariant Systems

We consider the decidability of state-to-state reachability in linear time-invariant control systems, with control sets defined by boolean combinations of linear inequalities. Decidability of the sub-problem in which control sets are linear subspaces is a fundamental result in control theory. We first show that reachability is undecidable if the set of controls is a finite union of affine subsp...

متن کامل

Time-Invariant State Feedback Control Laws for a Special Form of Underactuated Nonlinear Systems Using Linear State Bisection

Linear state bisection is introduced as a new method to find time-invariant state feedback control laws for a special form of underactuated nonlinear systems. The specialty of the systems considered is that every unactuated state should be coupled with at least two directly actuated states. The basic idea is based on bisecting actuated states and using linear combinations with adjustable parame...

متن کامل

Entropy of infinite systems and transformations

The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...

متن کامل

Robust gain-scheduled control of linear parameter-varying systems with uncertain scheduling parameters in the presence of the time-invariant uncertainties

In this paper, a new approach is presented to design a gain-scheduled state-feedback controller for uncertain linear parameter-varying systems. It is supposed that the state-space matrices of them are the linear combination of the uncertain scheduling parameters. It is assumed that the existed uncertainties are of type of time-invariant parametric uncertainties with specified intervals. Simulta...

متن کامل

Generating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton

Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003